class Solution:
def commonChars(self, words: List[str]) -> List[str]:
actual_dict = {}
for i in range(len(words[0])):
if words[0][i] in actual_dict:
actual_dict[words[0][i]]+=1
else:
actual_dict[words[0][i]]=1
for i in range(1, len(words), 1):
another = {}
for j in range(len(words[i])):
if words[i][j] in another:
another[words[i][j]] +=1
else:
another[words[i][j]] = 1
for j in actual_dict:
if j in another:
if another[j] <= actual_dict[j]:
actual_dict[j] = another[j]
else:
actual_dict[j] = -1
ans = []
for i in actual_dict:
if actual_dict[i] == -1:
continue
else:
ans+= [i] * actual_dict[i]
return ans
Duration | Birthday Party |
e-maze-in | Bricks Game |
Char Sum | Two Strings |
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |